A Parallel Algorithm for Circulant Tridiagonal Linear Systems
نویسندگان
چکیده
In this paper, based upon the divide-and-conquer strategy, we propose a parallel algorithm for solving the circulant tridiagonal systems, which is simpler than the two previous algorithms proposed by Agui and Jimenez ( 1995) and Chung et al. ( 1995). Our algorithm can be easily generalized to solve the tridiagonal systems, the block-tridiagonal systems, and the circulant block-tridiagonal systems. @ 1998 Elsevier Science B.V.
منابع مشابه
A VLSI Fast Solver for Tridiagonal Linear Systems
In this paper, the area-time complexity of a VLSI solver for tridiagonal linear systems is studied. Both a lower and an upper bound are derived which meet to within the exponent of the logarithmic factor. The proposed VLSI design derives from the parallel version of the well-known odd-even reduction algorithm [7] for tridiagonal linear systems, which requires O(log n) parallel steps. Then, the ...
متن کاملDivide and Conquer: A New Parallel Algorithm for the Solution of a Tridiagonal Linear System of Equations
Bondeli, S_, Divide and conquer: a parallel algorithm for the solution of a tridiagonal linear system of equations, Parallel Comput ing 17 (1991) 419-434_ We describe a divide and conquer algorithm which solves linear tridiagonal systems with one right-hand side, especially suited for parallel computers. The algorithm is flexible, permits multiprocessing or a combinat ion of vector and multipro...
متن کاملA Parallel Algorithm for Solving Tridiagonal Linear Systems on Distributed-Memory Multiprocessors
The coarse-grainded architecture model has been proposed to be a model of iently close existing parallel machines. Under this model we design a ommunication-efficient parallel algorithm for the solution of tridiagonal linear systems with n eq indicating the efficiency and scalability of proposed algorithm.
متن کاملA parallel solver for tridiagonal linear systems for distributed memory parallel computers
Brugnano, L_, A parallel solver for tridiagonal linear systems for distributed memory parallel computers, Parallel Computing 17 (1991) 1017-1023. The solution of linear tridiagonal systems is a very common problem in Numerical Analysis. Many algorithms are known for solving such linear systems on vector and parallel computers [3,4,6-9]. In this paper a new parallel method is presented, which is...
متن کاملAn hybrid parallel algorithm for solving tridiagonal linear systems
In this paper we describe an hybrid algorithm for an even number of processors based on an algorithm for two processors and the Overlapping Partition Method for tridiagonal systems. Moreover, we compare this hybrid method with the Partition Wang’s method in a BSP computer. Finally, we compare the theoretical computation cost of both methods for a Cray T3D computer, using the cost model that BSP...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 65 شماره
صفحات -
تاریخ انتشار 1998